On algorithmic equivalence in linear fractional programming
نویسندگان
چکیده
منابع مشابه
SENSITIVITY ANALYSIS IN LINEAR-PLUS-LINEAR FRACTIONAL PROGRAMMING PROBLEMS
In this paper, we study the classical sensitivity analysis when the right - hand – side vector, and the coefficients of the objective function are allowed to vary.
متن کاملOn duality in linear fractional programming
AlcOa'act. In this paper, a dual of a given linear fractional program is defined and the weak, direct and converse duality theorems are proved. Both the primal and the dual are linear fractional programs. This duality tI-.cory leads to necessary and sufficient conditions for the optimality of a given feasible solution. A unmerical example is presented to illustrate tI'.e t~eory in this connecti...
متن کاملsensitivity analysis in linear-plus-linear fractional programming problems
in this paper, we study the classical sensitivity analysis when the right - hand – side vector, and the coefficients of the objective function are allowed to vary.
متن کاملOn Solving Linear Fractional Programming Problems
A new method namely, denominator objective restriction method based on simplex method is proposed for solving linear fractional programming problems. Further, another method namely, decomposition-restriction method based on decomposition principle and the denominator objective restriction method is proposed for obtaining an optimal fuzzy solution to the fully fuzzy linear fractional programming...
متن کاملLinear fractional programming and duality
This paper presents a dual of a general linear fractional functions programming problem. Dual is shown to be a linear programming problem. Along with other duality theorems, complementary slackness theorem is also proved. A simple numerical example illustrates the result.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1981
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1981-0616370-1